Extensions on solutions of Boolean equations via its conjunctions
نویسندگان
چکیده
منابع مشابه
On the Decomposition of Boolean Functions via Boolean Equations
We propose an alternative solution to the problems solved in [1]. Our aim is to advocate the efficiency of algebraic methods for the solution of the Boolean equations which occur in the decomposition of Boolean functions.
متن کاملSome extensions of Darbo's theorem and solutions of integral equations of Hammerstein type
In this brief note, using the technique of measures of noncompactness, we give some extensions of Darbo fixed point theorem. Also we prove an existence result for a quadratic integral equation of Hammerstein type on an unbounded interval in two variables which includes several classes of nonlinear integral equations of Hammerstein type. Furthermore, an example is presented to show the effic...
متن کاملSolutions of Boolean equations by orthonormal expansion
Developments in solving equations over Boolean algebras and their applications are as old as George Boole’s monograph [1], while Shannon pioneered applications of Boolean logic to switching circuits. Boolean equations and their solutions are of central importance to many problems across Sciences such as Chemistry, Biology or Medicine while traditionally Boolean problems arise in domains such as...
متن کاملConstruction of General Subsumptive Solutions of Boolean Equations via Complete-sum Derivation
Boolean-equation solving permeates many diverse areas of modern science. To solve a system of Boolean equations, one usually combines them into an equivalent single Boolean equation {f (X) 0} = whose set of solutions is exactly the same as that of the original system of equations. One of the general classes of solutions for Boolean equations is the subsumptive general solution, in which each va...
متن کاملExtensions of Boolean isometries
We study when a map between two subsets of a Boolean domain W can be extended to an automorphism of W . Under many hypotheses, if the underlying Boolean algebra is complete or if the sets are finite or Boolean domains, the necessary and sufficient condition is that it preserves the Boolean distance between every couple of points.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1974
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90065-x